Orthogonal graphs modulo power of 2

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycles of length 2 modulo 3 in graphs

We prove a conjecture of Saito that if a graph G with ≥ 3 has no cycle of length 1 (mod 3), then G has an induced subgraph which is isomorphic to the Petersen graph. The above result strengthened the result by Dean et al. that every 2-connected graph with ≥ 3 has a (1 mod 3)-cycle if G is not isomorphic to the Petersen graph. ? 2001 Elsevier Science B.V. All rights reserved.

متن کامل

SAT Modulo Graphs: Acyclicity

Acyclicity is a recurring property of solutions to many important combinatorial problems. In this work we study embeddings of specialized acyclicity constraints in the satisfiability problem of the classical propositional logic (SAT). We propose an embedding of directed graphs in SAT, with arcs labelled with propositional variables, and an extended SAT problem in which all clauses have to be sa...

متن کامل

Representations of graphs modulo n

A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n− 1 inclusive such that two vertices are adjacent if and only if their labels are relatively prime to n. The representation number of graph G is the smallest n representing G. We review known results and investigate representation numbers for several new classes. In particular, we ...

متن کامل

Big symplectic or orthogonal monodromy modulo `

Let k be a field not of characteristic two and Λ be a set consisting of almost all rational primes invertible in k. Suppose we have a varietyX/k and strictly compatible system {M` → X : ` ∈ Λ} of constructible F`-sheaves. If the system is orthogonally or symplectically self-dual, then the geometric monodromy group of M` is a subgroup of a corresponding isometry group Γ` over F`, and we say it h...

متن کامل

A Fast Low-Power Modulo 2^n+1 Multiplier

Modulo 2 n +1 multiplier is one of the critical components in applications in the area of digital signal processing, data encryption and residue arithmetic that demand high-speed and low-power operation. In this paper, an efficient hardware architecture of modulo 2 n + 1 multiplier is proposed and validated to address the demand. The proposed modulo 2 n +1 multiplier has three major functional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 2019

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081087.2019.1582611